RAT-OWL: Reasoning with Rational Closure in Description Logics of Typicality
نویسندگان
چکیده
We present RAT-OWL, a software system for reasoning about typicality in preferential Description Logics. It is implemented in the form of a Protégé 4.3 Plugin and it allows the user to reason in a nonmonotonic extension of Description Logics based on the notion of “rational closure”. This logic extends standard Description Logics in order to express “typical” properties, that can be directly specified by means of a typicality operator T: a TBox can contain inclusions of the form T(C) v D to represent that “typical Cs are also Ds”. We show experimental results, indicating that the performances of RAT-OWL are promising.
منابع مشابه
An Efficient Reasoner for Description Logics of Typicality and Rational Closure
In this work we present RAT-OWL, a Protégé 4.3 Plugin for reasoning about typicality in preferential Description Logics. RAT-OWL allows the user to reason in a nonmonotonic extension of Description Logics based on the notion of “rational closure”. This logic extends standard Description Logics in order to express “typical” properties, that can be directly specified by means of a typicality oper...
متن کاملMaking Quantification Relevant Again
Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...
متن کاملMaking Quantification Relevant Again - the Case of Defeasible EL_\bot
Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...
متن کاملChair for Automata Theory LTCS – Report Making Quantification Relevant Again
Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...
متن کاملDefeasible Reasoning in SROEL: from Rational Entailment to Rational Closure
In this work we study a rational extension SROEL(⊓,×) T of the low complexity description logic SROEL(⊓,×), which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor’s ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017